Fast Connected Components Algorithms for the EREW PRAM
نویسندگان
چکیده
منابع مشابه
Efficient Geometric Algorithms on the EREW PRAM
We present a technique that can be used to obtain efficient parallel algorithms in the EREW-PRAM computational model. This technique enables us to optimally solve a number of geometric problems in O(logn) time using O(n/logn) EREW-PRAM processors, where n is the input size. These problerns include: computing the convex hull oCa sorted point set in the plane, computing the convex hull oCa simple...
متن کاملEfficient EREW PRAM Algorithms for Parentheses-Matching
We present four polylog-time parallel algorithms for matching parentheses on an exclusive-read and exclusive-write (EREW) parallel random-access machine (PRAM) model. These algorithms provide new insights into the parentheses-matching problem. The first algorithm has a time complexity of O( log’ n ) employing O( & ) processors for an input string containing ~1 parentheses. Although this algorit...
متن کاملOptimal Randomized EREW PRAM Algorithms for Finding Spanning Forests
We present the rst randomized O(log n) time and O(m+n) work EREW PRAM algorithm for nding a spanning forest of an undirected graph G = (V; E) with n vertices and m edges. Our algorithm is optimal with respect to time, work and space. As a consequence we get optimal randomized EREW PRAM algorithms for other basic connectivity problems such as nding a bipartite partition, nding bridges and biconn...
متن کاملOptimal Parallel Algorithms for the 3D Euclidean Distance Transform on the CRCW and EREW PRAM Models
In this paper, we develop parallel algorithms for the three-dimensional Euclidean distance transform (3D EDT) on both the CRCW and EREW PRAM computation models. Based on the dimensionality reduction technique and the solution for proximate points problem, we achieve the optimality of the 3D EDT computation. For an N × N × N binary image array, our parallel algorithms for 3D EDT computation are ...
متن کاملAnother Pram Algorithm for Finding Connected Components of Sparse Graphs
We present an algorithm which exploits a new approach to the problem of nding the connected components of an undirected graph, CCug for short, with v vertices and e edges. The algorithm has depth O(log 2 (e)) 1 on a CREW PRAM using e processors, hence its cost is not aaected by the number v of graph vertices. This makes the algorithm the one with best speedup and best cost for CCug on highly sp...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Computing
سال: 1998
ISSN: 0097-5397,1095-7111
DOI: 10.1137/s009753979325247x